Synthesis of Propositional Satisfiability Solvers

Development of system software by refinement has been extensively studied, and few larger scale case studies has been carried out. Most refinement approaches havse relied on manual construction of ad-hoc non-reusable refinements that are subjected to post-hoc verification. The problem with this approach is that the incremental cost of adapting to changing requirements is too high for this to be practical. Our belief is that refinement technology will only become feasible when most, if not all, refinements are generated correctly rather than constructed manually.